Optimal routing in a problem with constraints and cost functions depending on the task list

A routing problem with precedence conditions and complex cost functions is considered. In this problem, we must choose a starting point, route (permutation of indices) specific trajectory for our process. This be consistent the route. addition, or index permutation defines sequence tasks. selection above satisfy defined by system ordered pairs. These pairs are called address We consider additive criterion problem. natural dismantling radiation sources. article, will focus on engineering very naturally arise dependency list Namely, each time performer touches those only sources that were not dismantled at time. The solution uses widely understood dynamic programming. build optimal algorithm PC; information about computational experiment given.